Face Recognition with L1-norm Subspaces
نویسندگان
چکیده
We consider the problem of representing individual faces by maximum L1-norm projection subspaces calculated from available face-image ensembles. In contrast to conventional L2-norm subspaces, L1-norm subspaces are seen to offer significant robustness to image variations, disturbances, and rank selection. Face recognition becomes then the problem of associating a new unknown face image to the “closest,” in some sense, L1 subspace in the database. In this work, we also introduce the concept of adaptively allocating the available number of principal components to different face image classes, subject to a given total number/budget of principal components. Experimental studies included in this paper illustrate and support the theoretical developments.
منابع مشابه
Nuclear-L1 Norm Joint Regression for Face Reconstruction and Recognition
Recognizing a face with significant lighting, disguise and occlusion variations is an interesting and challenging problem in pattern recognition. To address this problem, many regression based methods, represented by sparse representation classifier (SRC), are presented recently. SRC uses the L1-norm to characterize the pixel-level sparse noise but ignore the spatial information of noise. In th...
متن کاملSparse two-dimensional local discriminant projections for feature extraction
Two-dimensional local graph embedding discriminant analysis (2DLGEDA) and two-dimensional discriminant locality preserving projections (2DDLPP) were recently proposed to directly extract features form 2D face matrices to improve the performance of two-dimensional locality preserving projections (2DLPP). But all of them require a high computational cost and the learned transform matrices lack di...
متن کاملGabor feature based robust representation and classification for face recognition with Gabor occlusion dictionary
By representing the input testing image as a sparse linear combination of the training samples via l1-norm minimization, sparse representation based classification (SRC) has shown promising results for face recognition (FR). Particularly, by introducing an identity occlusion dictionary to code the occluded portions of face images, SRC could lead to robust FR results against face occlusion. Howe...
متن کاملL1-norm-based (2D)PCA
Traditional bidirectional two-dimension (2D) principal component analysis ((2D)PCA-L2) is sensitive to outliers because its objective function is the least squares criterion based on L2-norm. This paper proposes a simple but effective L1-norm-based bidirectional 2D principal component analysis ((2D)PCA-L1), which jointly takes advantage of the merits of bidirectional 2D subspace learning and L1...
متن کاملRobust Face Recognition via Sparse Representation
In this project, we implement a robust face recognition system via sparse representation and convex optimization. We treat each test sample as sparse linear combination of training samples, and get the sparse solution via L1-minimization. We also explore the group sparseness (L2-norm) as well as normal L1-norm regularization.We discuss the role of feature extraction and classification robustnes...
متن کامل